A Simple Proof of Kaijser ’ S Unique Ergodicity Result for Hidden Markov Α - Chains
نویسندگان
چکیده
According to a 1975 result of T. Kaijser, if some nonvanishing product of hidden Markov model (HMM) stepping matrices is sub-rectangular, and the underlying chain is aperiodic, the corresponding α-chain has a unique invariant limiting measure λ. Here the α-chain {αn} = {(αni)} is given by where {(Xn, Yn)} is a finite state HMM with unobserved Markov chain component {Xn} and observed output component {Yn}. This defines {αn} as a stochastic process taking values in the probability simplex. It is not hard to see that {αn} is itself a Markov chain. The stepping matrices M (y) = (M (y)ij) give the probability that (Xn, Yn) = (j, y), conditional on Xn−1 = i. A matrix is said to be subrectangular if the locations of its nonzero entries forms a cartesian product of a set of row indices and a set of column indices. Kaijser's result is based on an application of the Furstenberg– Kesten theory to the random matrix products M (Y1)M (Y2) · · · M (Yn). In this paper we prove a slightly stronger form of Kaijser's theorem with a simpler argument, exploiting the theory of e chains. 1. Introduction. In 1975 Kaijser [9] gave a simple sufficient condition for the uniqueness of the invariant measure for the so-called α-chain, a certain weak Feller chain with compact state space arising in the study of an arbitrary finite state hidden Markov model. This provided an elegant partial answer to a question posed by David Blackwell in 1957 [3]. (We follow Blackwell in using α n to denote the state of the α-chain at time n. Kaijser calls it Z n .) The transition behavior of a finite state hidden Markov model (HMM) and of its associated α-chain can be specified by a finite collection
منابع مشابه
A complete solution to Blackwell's unique ergodicity problem for hidden Markov chains
We develop necessary and sufficient conditions for uniqueness of the invariant measure of the filtering process associated to an ergodic hidden Markov model in a finite or countable state space. These results provide a complete solution to a problem posed by Blackwell (1957), and subsume earlier partial results due to Kaijser, Kochman and Reeds. The proofs of our main results are based on the s...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملErgodic BSDEs Driven by Markov Chains
We consider ergodic backward stochastic differential equations, in a setting where noise is generated by a countable state uniformly ergodic Markov chain. We show that for Lipschitz drivers such that a comparison theorem holds, these equations admit unique solutions. To obtain this result, we show by coupling and splitting techniques that uniform ergodicity estimates of Markov chains are robust...
متن کاملQuantitative convergence rates of Markov chains: A simple account
We state and prove a simple quantitative bound on the total variation distance after k iterations between two Markov chains with different initial distributions but identical transition probabilities. The result is a simplified and improved version of the result in Rosenthal (1995), which also takes into account the -improvement of Roberts and Tweedie (1999), and which follows as a special case...
متن کاملA simple and efficient solution of the identifiability problem for hidden Markov processes and quantum random walks
A solution of the identifiability problem (IP) for hidden Markov processes (HMPs), based on a novel algebraic theory for random sources, is presented. It gives rise to an efficient and practical algorithm that can be easily implemented. Extant approaches are exponential in the number of hidden states and therefore only applicable to a limited degree. The algorithm can be equally applied to solv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006